A Behavioural Lambda Model
نویسندگان
چکیده
We build a lambda model which characterizes completely (persistently) normalizing, (persistently) head normalizing, and (persistently) weak head normalizing terms. This is proved by using the finitary logical description of the model obtained by defining a suitable intersection type assignment system.
منابع مشابه
Behavioural Equivalence and Indistinguishability in Higher-Order Typed Languages
We extend the study of the relationship between behavioural equivalence and the indistinguishability relation[4, 7] to the simply typed lambda calculus, where higher-order types are available. The relationship between these two notions is established in terms of factorisability[4]. The main technical tool of this study is pre-logical relations[8], which give a precise characterisation of behavi...
متن کاملBehavioural Subtyping for a Type-theoretic Model of Objects
We present a reenement of the existential object model of Pierce and Turner PT94]. In addition to signatures (or interfaces) as the types of objects, we also provide classes as the types of objects. These class types not only specify an interface, but also a particular implementation. We show that class types can be interpreted in the standard PER model. Our main result is that the standard int...
متن کاملThe Effect of Corporate Governance Mechanisms on Audit Quality by Explaining the Intermediary Function of Auditor's Behavioral Components
The purpose of this study was to investigate the structural pattern of the effect of corporate governance mechanisms (internal organization) on audit quality considering the role of the intermediary variable of behavioural components of auditors. The statistical population of this research is independent auditors and auditors working in audit firms. A sample of 395 people was selected by simple...
متن کاملA Behavioural Model for Klop's Calculus
A model characterising strong normalisation for Klop’s extension of λ-calculus is presented. The main technical tools for this result are an inductive definition of strongly normalising terms of Klop’s calculus and an intersection type system for terms of Klop’s calculus.
متن کاملA Model for Behavioural Properties of Higher-order Programs
We consider simply typed lambda-calculus with fixpoints as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as a potentially infinite tree of calls to built-in operations. Properties of such trees are properties of executions of programs and monadic second-order logic (MSOL) is well suited to express them. For a give...
متن کامل